Large-Scale Cost-Based Abduction in Full-Fledged First-Order Predicate Logic with Cutting Plane Inference
نویسندگان
چکیده
Abduction is inference to the best explanation. Abduction has long been studied intensively in a wide range of contexts, from artificial intelligence research to cognitive science. While recent advances in large-scale knowledge acquisition warrant applying abduction with large knowledge bases to real-life problems, as of yet no existing approach to abduction has achieved both the efficiency and formal expressiveness necessary to be a practical solution for large-scale reasoning on real-life problems. The contributions of our work are the following: (i) we reformulate abduction as an Integer Linear Programming (ILP) optimization problem, providing full support for first-order predicate logic (FOPL); (ii) we employ Cutting Plane Inference, which is an iterative optimization strategy developed in Operations Research for making abductive reasoning in full-fledged FOPL tractable, showing its efficiency on a real-life dataset; (iii) the abductive inference engine presented in this paper is made publicly available.
منابع مشابه
Uniied Inference in Extended Syllogism 1. Term Logic vs. Predicate Logic
There are two major traditions in formal logic: term logic and propo-sitional/predicate logic, exempliied respectively by the Syllogism of Aristotle and the First-Order Predicate Logic founded by Frege, Rus-sell, and Whitehead. Term logic is diierent from predicate logic in both its knowledge representation language and its inference rules. Term logic represents knowledge in subject{predicate s...
متن کاملCoreference Resolution with ILP-based Weighted Abduction
This paper presents the first systematic study of the coreference resolution problem in a general inference-based discourse processing framework. Employing the mode of inference called weighted abduction, we propose a novel solution to the overmerging problem inherent to inference-based frameworks. The overmerging problem consists in erroneously assuming distinct entities to be identical. In di...
متن کاملEfficient maximum a-posteriori inference in Markov logic and application in description logics
The maximum a-posteriori (MAP) query in statistical relational models computes the most probable world given evidence and further knowledge about the domain. It is arguably one of the most important types of computational problems, since it is also used as a subroutine in weight learning algorithms. In this thesis, we discuss an improved inference algorithm and an application for MAP queries. W...
متن کاملAbducing Rules with Predicate Invention
This paper addresses discovery of unknown relations from incomplete network data using abduction. Given a network information such as causal relations and metabolic pathways, we want to infer missing links and nodes in the network to account for observations. This is implemented in SOLAR, an automated deduction system for consequence finding, using first-order representation of algebraic relati...
متن کاملOn Skill Acquisition Support by Analogical Rule Abduction
This paper describes our development of analogical abduction as an extension to our work on meta level abductive reasoning for rule abduction and predicate invention. Previously, we gave a set of axioms to state the object level causalities in terms of first-order-logic (FOL) clauses, which represent direct and indirect causalities with transitive rules. Here we extend our formalism of the meta...
متن کامل